A Multi-engine Solver for Quantified Boolean Formulas
نویسندگان
چکیده
In this paper we study the problem of yielding robust performances from current state-of-the-art solvers for quantified Boolean formulas (QBFs). Building on top of existing QBF solvers, we implement a newmulti-engine solver which can inductively learn its solver selection strategy. Experimental results confirm that our solver is always more robust than each single engine, that it is stable with respect to various perturbations, and that such results can be partially explained by a handful of features playing a crucial role in our solver.
منابع مشابه
QuBE++: An Efficient QBF Solver
In this paper we describe QUBE++, an efficient solver for Quantified Boolean Formulas (QBFs). To the extent of our knowledge, QUBE++ is the first QBF reasoning engine that uses lazy data structures both for unit clauses propagation and for pure literals detection. QUBE++ also features non-chronological backtracking and a branching heuristic that leverages the information gathered during the bac...
متن کاملProving Valid Quantified Boolean Formulas in HOL Light
This paper describes the integration of Squolem, Quantified Boolean Formulas (QBF) solver, with the interactive theorem prover HOL Light. Squolem generates certificates of validity which are based on witness functions. The certificates are checked in HOL Light by constructing proofs based on these certificates. The presented approach allows HOL Light users to prove larger valid QBF problems tha...
متن کاملAn Alternative Representation for QBF
Quantified Boolean formulas are a powerful representation that have been used to capture and solve a variety of problems in Artificial Intelligence. While most research has focused on quantified Boolean formulas in prenex normal form (QBF), we explore an alternative representation of quantified Boolean formulas, called Constrained Quantified Formulas (CQF). CQF allows for a more direct represen...
متن کاملDealing with Symmetries in Quantified Boolean Formulas
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting symmetries has been proved very important in reducing search efforts. This important task is widely investigated in constraint satisfaction problems and satisfiability of boolean formulas. In this paper, we show how symmetries can be naturally extended to Quantified Boolean Formulas (QBFs). A symmetries detection algo...
متن کاملHybrid Solving for Quantified Boolean Formulas Based on SVM and Reinforcement Learning ⋆
In this paper, a new SVM classification algorithm is proposed, this algorithm is applied in Quantified Boolean Formulas (QBF) hybrid solving and a new QBF hybrid solver is designed. This solver apply SVM algorithm to construct inductive models and classify the formulae. At the same time, the reinforcement learning technology is applied to realize the dynamic algorithm selection. The relationshi...
متن کامل